منابع مشابه
From Node Embedding To Community Embedding
In this paper, we introduce a new setting for graph embedding, which considers embedding communities instead of individual nodes. Community embedding is useful as a natural community representation for applications, and it provides an exciting opportunity to improve community detection. Specifically, we see the interaction between community embedding and detection as a closed loop, through node...
متن کاملNode Centralities and Classification Performance for Characterizing Node Embedding Algorithms
Embedding graph nodes into a vector space can allow the use ofmachine learning to e.g. predict node classes, but the study of node embedding algorithms is immature compared to the natural language processing field because of a diverse nature of graphs. We examine the performance of node embedding algorithms with respect to graph centrality measures that characterize diverse graphs, through syst...
متن کاملCooperation in Normal Form Games
This research explores the problem of cooperation. It is possible to develop cooperative strategies for a specific environment, but those strategies are unlikely to apply to other environments. To avoid that problem, we work in an environment that is flexible enough to be used to describe an arbitrary environment. We have found a a method by which cooperation can be achieved in that environment...
متن کاملSmith normal form in combinatorics
This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith normal form of random integer matrices. We then give some examples of Smith normal form and diagonal form arising from (1) symmetric functions, (2) a result of Ca...
متن کاملFault-tolerant cycle embedding in dual-cube with node faults
A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m + 1 links per node, where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2 clusters and hence the total number of nodes in a DC(m) is 2 + . In this paper, by using Gray code, we show that there exists a fault-free cycle containi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2002
ISSN: 0022-0000
DOI: 10.1006/jcss.2002.1851